Further Results on Generalized Hamming Weights for Goethals and Preparata Codes Over Z4
نویسندگان
چکیده
This paper contains results on the generalized Hamming weights for the Goethals and Preparata codes over Z 4 : We give an upper bound on the rth generalized Hamming weights d r (m; j) for the Goethals code G m (j) of length 2 m over Z 4 , when m is odd. We also determine d 3:5 (m; j) exactly. The upper bound is shown to be tight up to r = 3:5. Furthermore we determine the rth generalized Hamming weight d r (m) for the Preparata code of length 2 m over Z 4 when r = 3:5 and r = 4:
منابع مشابه
The Z4-linearity of Kerdock, Preparata, Goethals, and related codes
Certain notorious nonlinear binary codes contain more codewords than any known linear code. These include the codes constructed by Nordstrom-Robinson , Kerdock, Preparata, Goethals, and Delsarte-Goethals . It is shown here that all these codes can be very simply constructed as binary images under the Gray map of linear codes over Z4, the integers mod 4 (although this requires a slight modificat...
متن کاملTranslates of Linear Codes Over
We give a method to compute the complete weight distribution of translates of linear codes over Z4. The method follows known ideas that have already been used successfully by others for Hamming weight distributions. For the particular case of quaternary Preparata codes, we obtain that the number of distinct complete weights for the dual Preparata codes and the number of distinct complete coset ...
متن کاملNew Ring-Linear Codes from Geometric Dualization
In the 1960s and 1970s the Nordstrom-Robinson-Code [30] and subsequently the infinite series of the Preparata[31], Kerdock[21], Delsarte-Goethals[6] and Goethals-Codes [7] were discovered. Apart from a few corner cases, all of these codes are non-linear binary block codes that have higher minimum distance than any known comparable (having equal size and length) linear binary code. We will call ...
متن کامل4 - Linearity of Kerdock , Preparata , Goethals and Related Codes ∗
Certain notorious nonlinear binary codes contain more codewords than any known linear code. These include the codes constructed by Nordstrom-Robinson , Kerdock, Preparata, Goethals, and Delsarte-Goethals . It is shown here that all these codes can be very simply constructed as binary images under the Gray map of linear codes over 4, the integers mod 4 (although this requires a slight modificati...
متن کاملOn the Apparent Duality of the Kerdock and Preparata Codes
The Kerdock and extended Preparata codes are something of an enigma in coding theory since they are both Hamming-distance invariant and have weight enumerators that are MacWilliams duals just as if they were dual linear codes. In this paper, we explain, by constructing in a natural way a Preparata-like code PL from the Kerdock code K, why the existence of a distance-invariant code with weight d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 45 شماره
صفحات -
تاریخ انتشار 1999